Self-adaptive online virtual network migration in network virtualization environments

This is the peer reviewed version of the following article: Zangiabady, M, Garcia‐Robledo, A, Gorricho, J‐L, Serrat‐Fernandez, J, Rubio‐Loyola, J. Self‐adaptive online virtual network migration in network virtualization environments. Trans Emerging Tel Tech. 2019; 30:e3692. https://doi.org/10.1002/ett.3692, which has been published in final form at https://doi.org/10.1002/ett.3692. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.In Network Virtualization Environments, the capability of operators to allocate resources in the Substrate Network (SN) to support Virtual Networks (VNs) in an optimal manner is known as Virtual Network Embedding (VNE). In the same context, online VN migration is the process meant to reallocate components of a VN, or even an entire VN among elements of the SN in real time and seamlessly to end-users. Online VNE without VN migration may lead to either over- or under-utilization of the SN resources. However, VN migration is challenging due to its computational cost and the service disruption inherent to VN components reallocation. Online VN migration can reduce migration costs insofar it is triggered proactively, not reactively, at critical times, avoiding the negative effects of both under- and over-triggering. This paper presents a novel online cost-efficient mechanism that self-adaptively learns the exact moments when triggering VN migration is likely to be profitable in the long term. We propose a novel self-adaptive mechanism based on Reinforcement Learning that determines the right trigger online VN migration times, leading to the minimization of migration costs while simultaneously considering the online VNE acceptance ratio.Peer ReviewedPostprint (author's final draft

Fast and efficient energy-oriented cell assignment in heterogeneous networks

The cell assignment problem is combinatorial, with increased complexity when it is tackled considering resource allocation. This paper models joint cell assignment and resource allocation for cellular heterogeneous networks, and formalizes cell assignment as an optimization problem. Exact algorithms can find optimal solutions to the cell assignment problem, but their execution time increases drastically with realistic network deployments. In turn, heuristics are able to find solutions in reasonable execution times, but they get usually stuck in local optima, thus failing to find optimal solutions. Metaheuristic approaches have been successful in finding solutions closer to the optimum one to combinatorial problems for large instances. In this paper we propose a fast and efficient heuristic that yields very competitive cell assignment solutions compared to those obtained with three of the most widely-used metaheuristics, which are known to find solutions close to the optimum due to the nature of their search space exploration. Our heuristic approach adds energy expenditure reduction in its algorithmic design. Through simulation and formal statistical analysis, the proposed scheme has been proved to produce efficient assignments in terms of the number of served users, resource allocation and energy savings, while being an order of magnitude faster than metaheuritsic-based approaches.This paper has been supported by the National Council of Research and Technology (CONACYT) through Grant FONCICYT/272278 and the ERANetLAC (Network of the European Union, Latin America, and the Caribbean Countries) Project ELAC2015/T100761. This paper is partially supported also by the ADVICE Project, TEC2015-71329 (MINECO/FEDER) and the European Union’s Horizon 2020 research and innovation programme under Grant Agreement No 777067 (NECOS Project)

Joint route selection and split level management for 5G C-RAN

This work tackles the problem faced by network/infrastructure providers of jointly selecting routing and functional split level to satisfy requests from virtual mobile network operators (vMNOs). We build a novel system model that brings together all the involved elements and features, embracing split levels defined by the 3GPP and packet switch fronthaul network. To our best knowledge, this is the first work that provides a solution for multiple vMNO requests considering the two aforementioned sub-problems (i.e. split selection and routing). We use the model defined to formulate an optimization problem, which is characterized by the exponential size of its search space. We propose two heuristic approaches to address this problem: (1) a greedy scheme, and (2) an evolutionary algorithm, which is also improved with a specialized initialization. We conduct extensive experiments to assess the performance and behavior of the proposed methods, over varying network instances. When possible, we also perform comparisons with respect to the optimal solution and a well-known commercial solver. Our results indicate that the proposed techniques represent appropriate trade-offs between solution quality and execution time, and can serve complementary goals: the quality of the results yielded by our evolutionary method are better, but at the cost of longer execution times; in contrast, our greedy algorithm offers a reasonably appropriate performance, with an execution time that is notably lower. Our experiments show that it is possible to produce near-optimal results to the above complex problem through computationally efficient algorithmic solutions.This paper has been partially supported by the Secretary of Public Education of Mexico (SEP) and Cinvestav through research grant 262, and the National Council of Research and Technology (CONACYT) through grant ERANetLACFONCICYT No. 272278. Luis Diez and Ramon Agüero acknowledge the funding by the Spanish Government (Ministerio de Economía y Competitividad, Fondo Europeo de Desarrollo Regional, MINECO-FEDER) by means of the project FIERCE: Future Internet Enabled Resilient smart CitiEs (RTI2018-093475-AI00)

The AutoI approach for the orchestration of autonomic networks

Existing services require assurable end to-end quality of service, security and reliability constraints. Therefore, the networks involved in the transport of the data must cooperate to satisfy those constraints. In a next generation Internet, each of those networks may be managed by different entities. Fur thermore, their policies and service level agreements (SLAs) will differ, as well as the autonomic management systems controlling them. In this context, we in the Autonomic Internet (AutoI) consortium propose the Orchestration Plane (OP), which promotes the interaction among different Autonomic Management Systems (AMSs). The OP mediates the communication and negotiation amongAMSs, ensuring that their SLAs and policies meet the requirement needed for the provisioning of the services. It also simplifies the federation of domains and the distribution of new services in virtualised network environments.Peer ReviewedPostprint (author’s final draft

Reliable Multihop Broadcast Protocol with a Low-Overhead Link Quality Assessment for ITS Based on VANETs in Highway Scenarios

Vehicular ad hoc networks (VANETs) have been identified as a key technology to enable intelligent transport systems (ITS), which are aimed to radically improve the safety, comfort, and greenness of the vehicles in the road. However, in order to fully exploit VANETs potential, several issues must be addressed. Because of the high dynamic of VANETs and the impairments in the wireless channel, one key issue arising when working with VANETs is the multihop dissemination of broadcast packets for safety and infotainment applications. In this paper a reliable low-overhead multihop broadcast (RLMB) protocol is proposed to address the well-known broadcast storm problem. The proposed RLMB takes advantage of the hello messages exchanged between the vehicles and it processes such information to intelligently select a relay set and reduce the redundant broadcast. Additionally, to reduce the hello messages rate dependency, RLMB uses a point-to-zone link evaluation approach. RLMB performance is compared with one of the leading multihop broadcast protocols existing to date. Performance metrics show that our RLMB solution outperforms the leading protocol in terms of important metrics such as packet dissemination ratio, overhead, and delay

Manageability of Future Internet Virtual Networks from a Practical Viewpoint

International audienceThe Autonomic Internet project approach relies on abstractions and distributed systems of a five plane solution for the provision of Future Internet Services (OSKMV): Orchestration, Service Enablers, Knowledge, Management and Virtualisation Planes. This paper presents a practical viewpoint of the manageability of virtual networks, exercising the components and systems that integrate this approach and that are being validated. This paper positions the distributed systems and networking services that integrate this solution, focusing on the provision of Future Internet services for self-configuration and self- performance management scenes

Platforms and software systems for an autonomic internet

The current Internet does not enable easy introduction and deployment of new network technologies and services. This paper aims to progress the Future Internet (FI) by introduction of a service composition and execution environment that re-use existing components of access and core networks. This paper presents essential service-centric platforms and software systems that have been developed with the aim to create a flexible environment for an Autonomic Internet.Peer ReviewedPostprint (published version

Ciencia Odontológica 2.0

Libro que muestra avances de la Investigación Odontológica en MéxicoEs para los integrantes de la Red de Investigación en Estomatología (RIE) una enorme alegría presentar el segundo de una serie de 6 libros sobre casos clínicos, revisiones de la literatura e investigaciones. La RIE está integrada por cuerpos académicos de la UAEH, UAEM, UAC y UdeG

A methodological approach to policy refinement in policy-based management systems

En la actualidad se están realizando diversos esfuerzos para realizar la visión fu-turista de las redes de telecomunicación autogestionadas. La gestión basada en políticas ha sido reconocida como una herramienta potencial para habilitar esta visión. Mayorita-riamente, ésta técnica ha sido reconocida como proveedora de flexibilidad, adaptabilidad y soporte para asignar recursos, controlar Calidad de Servicio y seguridad, de una manera automática y de acuerdo a reglas administrativas. Adicionalmente, se ha considerado que la gestión basada en políticas proveería tal flexibilidad en tiempo de ejecución y como resultado de cambios en la red, interacciones entre usuarios, aplicaciones y disponibilidad de recursos. A pesar de enormes esfuerzos realizados con lenguajes de especificación de políticas, arquitecturas de gestión en diversos dominios y estandarización, la gestión ba-sada en políticas aún no es una realidad. Una de las razones para la reticencia en su utili-zación es la dificultad para analizar políticas que garanticen estabilidad en el sistema. Además de la problemática asociada a la gestión de conflictos entre políticas, otro obstá-culo para su utilización es la dificultad de derivar políticas ejecutables alineadas a objeti-vos administrativos o a otras políticas de alto nivel. Este último es el problema del refi namiento de políticas.Esta Tesis aborda el problema crítico de refinamiento de políticas. Damos una vi-sión completa del proceso de refinamiento, desde el análisis formal hasta su realización práctica, identificando los elementos que intervienen en cada paso de tal proceso. Inicialmente, proponemos un marco de trabajo para refinamiento de políticas ba-sado en Lógica Lineal Temporal, una lógica estándar que permite el análisis en sistemas reactivos. Esta técnica es utilizada para representar políticas a diferentes niveles jerár-quicos de abstracción. Acto seguido desarrollamos mecanismos que habilitan la obten-ción de políticas ejecutables a partir de ciertos requerimientos mediante la utilización de técnicas de exploración de estados basados en Lógica Lineal Temporal. Adicionalmente, aclaramos e identificamos las actividades y tareas de gestión de las partes administrativas durante el ciclo de vida de un sistema de gestión basado en políticas, desde la perspectiva del proceso de refinamiento de políticas. Esta Tesis presenta también directrices para abordar el proceso de refinamiento de políticas en contextos de gestión de red. Damos un paso adelante en la materialización de este proceso mediante la utilización de propiedades estructurales inherentes a sistemas de gestión de red. Proveemos, en fin, una metodología para aplicar los conceptos introduci-dos en el marco de trabajo desarrollado en esta Tesis en sistemas de gestión de red. En esta Tesis también realizamos un proceso de refinamiento de políticas com-pleto. Detallamos la realización de tal proceso en una solución exitosa de gestión basada en políticas. Tomando como base el dominio de Gestión de Calidad de Servicio, aclara-mos y presentamos las implicaciones del problema de refinamiento en este dominio de aplicación.Current research efforts are being directed to commit with the long-term view of self management properties for telecommunications networks. One of the key approaches that have been recognised as an enabler of such a view is policy-based management. Pol-icy-based management has been mostly acknowledged as a methodology that provides flexibility, adaptability and support to automatically assign network resources, control Quality of Service and security, by considering administratively specified rules. The hype of policy-based management was to commit with these features in run-time as a result of changeable network conditions resulting from the interactions of users, applications and existing resources. Despite enormous efforts with policy languages, management archi-tectures using policy in different application domains, standardisation and industrial ef-forts, policy-based management is still not a reality. One reason behind the reticence for its use is the difficulty to analyse policies that guarantee configuration stability. In addi-tion to policy conflict analysis, a key issue for this reticence is the need to derive en-forceable policies from high level administrative goals or from higher level policies, namely the policy refinement process.This Thesis deals with the critical nature of addressing the policy refinement problem. We provide a holistic view of this process, from formal analysis to its practical realisation, identifying the key elements involved in each step of such critical process. We initially propose a policy refinement framework relying on Linear Temporal Logic (LTL), a standard logic that allows analysis of reactive systems. Based on the for-mer logic, we lay down the process of representing policies at different levels of abstrac-tion. Following on with this, we develop the mechanisms that enable the abstraction of enforceable policies from hierarchical requirements in a fully automatic manner, making use of Linear Temporal Logic based state exploration techniques. In addition, we clarify and identify the activities and management tasks that the administrative parties should carry out during the life cycle of the policy-based management system, from the perspec tive of the policy refinement process.This Thesis provides the guidelines to address policy refinement in network management contexts. Concretely, we take one step ahead in the materialisation of the policy refinement process by exploiting inherent containment properties of network management systems. For this purpose we provide the methodology to apply the concepts introduced in the policy refinement framework developed in this Thesis in the above context.In this Thesis we also execute a complete and rather detailed policy refinement process for a successful policy-based management solution. Taking the intra-domain Quality of Service Management application domain as background, we clarify and pre-sent the implications of the policy refinement problem in such a concrete application do-main

Aprovisionamiento de red mediante un sistema de gestión basado en políticas

Tesis (Maestría en Ciencias en Sistemas Digitales), Instituto Politécnico Nacional, CITEDI, 2003, 1 archivo PDF, (143 páginas). tesis.ipn.m